Hom Complexes of Set Systems
نویسندگان
چکیده
منابع مشابه
Hom Complexes of Set Systems
A set system is a pair S = (V (S),∆(S)), where ∆(S) is a family of subsets of the set V (S). We refer to the members of ∆(S) as the stable sets of S. A homomorphism between two set systems S and T is a map f : V (S) → V (T ) such that the preimage under f of every stable set of T is a stable set of S. Inspired by a recent generalization due to Engström of Lovász’s Hom complex construction, the ...
متن کاملThe Universality of Hom Complexes
It is shown that if T is a connected nontrivial graph and X is an arbitrary finite simplicial complex, then there is a graph G such that the complex Hom(T, G) is homotopy equivalent to X. The proof is constructive, and uses a nerve lemma. Along the way several results regarding Hom complexes, exponentials, and subdivision are established that may be of independent interest.
متن کاملHomotopy groups of Hom complexes of graphs
The notion of ×-homotopy from [Doca] is investigated in the context of the category of pointed graphs. The main result is a long exact sequence that relates the higher homotopy groups of the space Hom∗(G,H) with the homotopy groups of Hom∗(G,H ). Here Hom∗(G,H) is a space which parameterizes pointed graph maps from G to H (a pointed version of the usual Hom complex), and H is the graph of based...
متن کاملThe universality of Hom complexes of graphs
It is shown that given a connected graph T with at least one edge and an arbitrary finite simplicial complex X, there is a graph G such that the complex Hom(T,G) is homotopy equivalent to X. The proof is constructive, and uses a nerve lemma. Along the way several results regarding Hom complexes, exponentials of graphs, and subdivisions are established that may be of independent interest.
متن کاملDissections, Hom-complexes and the Cayley trick
We show that certain canonical realizations of the complexes Hom(G,H) and Hom+(G,H) of (partial) graph homomorphisms studied by Babson and Kozlov are in fact instances of the polyhedral Cayley trick. For G a complete graph, we then characterize when a canonical projection of these complexes is itself again a complex, and exhibit several well-known objects that arise as cells or subcomplexes of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2013
ISSN: 1077-8926
DOI: 10.37236/3009